Total strong (weak) domination in bipolar fuzzy graph

Total Semi - μ Strong (Weak) Domination in Intuitionistic Fuzzy Graph

In the initial stage we proposed the concept of Total Strong (Weak) domination in Fuzzy graph. It deal with the real time application that helps a individual person in crossing a road traffic signal. We will be giving a single value for vertices and edges. Enhancing the same concept, the Total Strong (Weak) domination in Intuitionistic Fuzzy graph was proposed. Here we will be giving a double v...

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

Total Strong (Weak) Domination Intuitionistic Fuzzy Graph

Some results on Bipolar Fuzzy Graph

In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...

Total Domination in Fuzzy Graphs Using Strong Arcs

In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzz...